- right sibling
- SAP.тех. правый (узел -)"брат "
Универсальный англо-русский словарь. Академик.ру. 2011.
right sibling
Смотреть что такое "right sibling" в других словарях:
Left child-right sibling binary tree — In computer science, a left child right sibling binary tree is a binary tree representation of a k ary tree. The process of converting from a k ary tree to an LC RS binary tree is not reversible in general without additional information.To form a … Wikipedia
Sibling rivalry — is a type of competition or animosity among brothers and sisters, blood related or not. 82% of people in Western countries have at least one sibling, and siblings generally spend more time together during childhood than they do with parents. The… … Wikipedia
Sibling — Brother(s) and Sister(s) redirect here. For other uses, see Brother (disambiguation), Brothers (disambiguation), Sister (disambiguation), and Sisters (disambiguation) Relationships … Wikipedia
List of sibling pairs — This list includes certain twins which are also covered in List of twins, provided said twins have at least one additional older or younger sibling. : Siblings are arranged alphabetically by last name, then listed from oldest to youngest. * Ben… … Wikipedia
Rot-Schwarz-Baum — Ein Rot Schwarz Baum ist in der Informatik eine vom binären Suchbaum abgeleitete Datenstruktur, die sehr schnellen Zugriff auf die in ihr gespeicherten Werte garantiert. Rot Schwarz Bäume wurden zuerst 1972 von Rudolf Bayer beschrieben[1],… … Deutsch Wikipedia
Red-black-tree — Ein Rot Schwarz Baum ist in der Informatik eine vom binären Suchbaum abgeleitete Datenstruktur, die sehr schnellen Zugriff auf die in ihr gespeicherten Werte garantiert. Rot Schwarz Bäume wurden zuerst 1972 von Rudolf Bayer beschrieben[1],… … Deutsch Wikipedia
Schwarz-Rot-Baum — Ein Rot Schwarz Baum ist in der Informatik eine vom binären Suchbaum abgeleitete Datenstruktur, die sehr schnellen Zugriff auf die in ihr gespeicherten Werte garantiert. Rot Schwarz Bäume wurden zuerst 1972 von Rudolf Bayer beschrieben[1],… … Deutsch Wikipedia
B-tree — In computer science, a B tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. It is most commonly used in databases and filesystems. In B trees, internal (non leaf)… … Wikipedia
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Tree structure — A tree structure showing the possible hierarchical organization of an encyclopedia … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
